Monotone control of queueing networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotone control of queueing networks

This paper uses submodularity to obtain monotonicity results for a class of Markovian queueing network service rate control problems. Nonlinear costs of queueing and service are allowed. In contrast to Weber and Stidham [14], our monotonicity theorem considers arbitrary directions in the state space (not just control directions), arrival routing problems, and certain uncontrolled service rates....

متن کامل

Efficiency of simulation in monotone hyper-stable queueing networks

We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficiency of sampling from their stationary distribution. In the context of exact sampling, the monotonicity structure of JQNs ensures that such efficiency is of the order of the coupling time (or meeting time) of two extremal sample paths. In the context of approximate sampling, it is given by the mixin...

متن کامل

Robust Fluid Control of Multiclass Queueing Networks

This thesis applies recent advances in the field of robust optimization to the optimal control of multiclass queueing networks. We develop models that take into account the uncertainty of interarrival and service time in multiclass queueing network problems without assuming a specific probability distribution, while remaining highly tractable and providing insight into the corresponding optimal...

متن کامل

Optimal Power Control for Wireless Queueing Networks

In this paper, we address the problem of power control in wireless queueing networks. We consider a discrete time (slotted) wireless system of single link. Data arrive in packets according to a Bernoulli process of rate λ. A simple ARQ (send and wait) retransmission policy is used for the transmission of packets. The control parameter in this system is the transmission power of a packet, which ...

متن کامل

Dynamic Control for Nonstationary Queueing Networks

Nonstationary queueing networks are notoriously difficult to analyze and control. One reason is that steady state analysis and techniques are not useful since the model parameters in practice are not constant and depend on time. In this work, we analyze two optimal control problems for nonstationary Jackson networks with abandonment where our main goal is to optimally control the number of serv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Queueing Systems

سال: 1992

ISSN: 0257-0130,1572-9443

DOI: 10.1007/bf01158810